0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.13	% Command    : run_E %s %d THM
0.12/0.34	% Computer : n007.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 960
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Aug  9 01:49:12 EDT 2022
0.12/0.34	% CPUTime    : 
0.20/0.49	Running higher-order on 8 cores theorem proving
0.20/0.49	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.49	# Version: 3.0pre003-ho
0.20/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.50	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.20/0.50	# Starting almost_fo_3_lam with 120s (1) cores
0.20/0.50	# Starting post_as_ho1 with 120s (1) cores
0.20/0.50	# ho_unfolding_3 with pid 8635 completed with status 0
0.20/0.50	# Result found by ho_unfolding_3
0.20/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HHUNS-FFSF21-SHSSMFNN
0.20/0.50	# partial match(2): HHHNS-FFSF11-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 5 cores with 600 seconds (600 total)
0.20/0.50	# Starting new_ho_10 with 325s (1) cores
0.20/0.50	# Starting ho_unfolding_3 with 61s (1) cores
0.20/0.50	# Starting ehoh_best_sine_rwall with 55s (1) cores
0.20/0.50	# Starting lpo1_def_fix with 55s (1) cores
0.20/0.50	# Starting ehoh_best8_lambda with 55s (1) cores
0.20/0.50	# ehoh_best8_lambda with pid 8643 completed with status 0
0.20/0.50	# Result found by ehoh_best8_lambda
0.20/0.50	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.50	# Starting ho_unfolding_3 with 600s (5) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HHUNS-FFSF21-SHSSMFNN
0.20/0.50	# partial match(2): HHHNS-FFSF11-SHSSMFNN
0.20/0.50	# Scheduled 6 strats onto 5 cores with 600 seconds (600 total)
0.20/0.50	# Starting new_ho_10 with 325s (1) cores
0.20/0.50	# Starting ho_unfolding_3 with 61s (1) cores
0.20/0.50	# Starting ehoh_best_sine_rwall with 55s (1) cores
0.20/0.50	# Starting lpo1_def_fix with 55s (1) cores
0.20/0.50	# Starting ehoh_best8_lambda with 55s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_22, type, mrel: mworld > mworld > $o).
0.20/0.50	thf(decl_23, type, mactual: mworld).
0.20/0.50	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.20/0.50	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_32, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_33, type, mexists_di: ($i > mworld > $o) > mworld > $o).
0.20/0.50	thf(decl_34, type, h: $i > mworld > $o).
0.20/0.50	thf(decl_35, type, bomb: $i > mworld > $o).
0.20/0.50	thf(decl_36, type, defused: $i > mworld > $o).
0.20/0.50	thf(decl_37, type, esk1_1: mworld > $i).
0.20/0.50	thf(decl_38, type, esk2_2: mworld > $i > $i).
0.20/0.50	thf(decl_39, type, esk3_0: $i).
0.20/0.50	thf(decl_40, type, esk4_0: mworld).
0.20/0.50	thf(decl_41, type, esk5_0: $i).
0.20/0.50	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.50	thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mand_def)).
0.20/0.50	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mimplies_def)).
0.20/0.50	thf(mbox_def, axiom, ((mbox)=(^[X1:mworld > $o, X3:mworld]:(![X5:mworld]:(((mrel @ X3 @ X5)=>(X1 @ X5)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mbox_def)).
0.20/0.50	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mforall_di_def)).
0.20/0.50	thf(mexists_di_def, axiom, ((mexists_di)=(^[X8:$i > mworld > $o, X3:mworld]:(?[X7:$i]:((X8 @ X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mexists_di_def)).
0.20/0.50	thf(ax3, axiom, (mlocal @ (mbox @ (mforall_di @ (^[X7:$i]:(mexists_di @ (^[X11:$i]:(mbox @ (mimplies @ (mand @ (bomb @ X7) @ (h @ X11)) @ (defused @ X7))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax3)).
0.20/0.50	thf(con, conjecture, (mlocal @ (mbox @ (mforall_di @ (^[X7:$i]:(mexists_di @ (^[X11:$i]:(mimplies @ (mand @ (bomb @ X7) @ (h @ X11)) @ (defused @ X7)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', con)).
0.20/0.50	thf(mrel_reflexive, axiom, ![X3:mworld]:((mrel @ X3 @ X3)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mrel_reflexive)).
0.20/0.50	thf(c_0_9, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.50	thf(c_0_10, plain, ((mand)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])).
0.20/0.50	thf(c_0_11, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.20/0.50	thf(c_0_12, plain, ((mbox)=(^[Z0:mworld > $o, Z1:mworld]:(![X5:mworld]:(((mrel @ Z1 @ X5)=>(Z0 @ X5)))))), inference(fof_simplification,[status(thm)],[mbox_def])).
0.20/0.50	thf(c_0_13, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.20/0.50	thf(c_0_14, plain, ((mexists_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(?[X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_di_def])).
0.20/0.50	thf(c_0_15, plain, ![X22:mworld]:(((mrel @ mactual @ X22)=>![X21:$i]:(?[X20:$i]:(![X19:mworld]:(((mrel @ X22 @ X19)=>(((bomb @ X21 @ X19)&(h @ X20 @ X19))=>(defused @ X21 @ X19)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax3]), c_0_9]), c_0_10]), c_0_11]), c_0_12]), c_0_13]), c_0_14])).
0.20/0.50	thf(c_0_16, negated_conjecture, ~(![X29:mworld]:(((mrel @ mactual @ X29)=>![X28:$i]:(?[X27:$i]:((((bomb @ X28 @ X29)&(h @ X27 @ X29))=>(defused @ X28 @ X29))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]), c_0_9]), c_0_10]), c_0_11]), c_0_12]), c_0_13]), c_0_14])).
0.20/0.50	thf(c_0_17, plain, ![X35:mworld, X36:$i, X38:mworld]:((~(mrel @ mactual @ X35)|(~(mrel @ X35 @ X38)|(~(bomb @ X36 @ X38)|~(h @ (esk2_2 @ X35 @ X36) @ X38)|(defused @ X36 @ X38))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])).
0.20/0.50	thf(c_0_18, negated_conjecture, ![X45:$i]:(((mrel @ mactual @ esk4_0)&(((bomb @ esk5_0 @ esk4_0)&(h @ X45 @ esk4_0))&~(defused @ esk5_0 @ esk4_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])).
0.20/0.50	thf(c_0_19, plain, ![X7:$i, X3:mworld, X5:mworld]:(((defused @ X7 @ X5)|~((mrel @ mactual @ X3))|~((mrel @ X3 @ X5))|~((bomb @ X7 @ X5))|~((h @ (esk2_2 @ X3 @ X7) @ X5)))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.20/0.50	thf(c_0_20, negated_conjecture, ![X7:$i]:((h @ X7 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.50	thf(c_0_21, negated_conjecture, ![X7:$i, X3:mworld]:(((defused @ X7 @ esk4_0)|~((mrel @ mactual @ X3))|~((bomb @ X7 @ esk4_0))|~((mrel @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.20/0.50	thf(c_0_22, negated_conjecture, (bomb @ esk5_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.50	thf(c_0_23, negated_conjecture, ~((defused @ esk5_0 @ esk4_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.50	thf(c_0_24, plain, ![X46:mworld]:((mrel @ X46 @ X46)), inference(variable_rename,[status(thm)],[mrel_reflexive])).
0.20/0.50	thf(c_0_25, negated_conjecture, ![X3:mworld]:((~((mrel @ mactual @ X3))|~((mrel @ X3 @ esk4_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])).
0.20/0.50	thf(c_0_26, plain, ![X3:mworld]:((mrel @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.50	thf(c_0_27, negated_conjecture, (mrel @ mactual @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.50	thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 32
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 25
0.20/0.50	# Removed in clause preprocessing      : 16
0.20/0.50	# Initial clauses in saturation        : 9
0.20/0.50	# Processed clauses                    : 26
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 0
0.20/0.50	# ...remaining for further processing  : 26
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 1
0.20/0.50	# Backward-rewritten                   : 0
0.20/0.50	# Generated clauses                    : 15
0.20/0.50	# ...of the previous two non-redundant : 9
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 15
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 16
0.20/0.50	#    Positive orientable unit clauses  : 6
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 1
0.20/0.50	#    Non-unit-clauses                  : 9
0.20/0.50	# Current number of unprocessed clauses: 1
0.20/0.50	# ...number of literals in the above   : 3
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 10
0.20/0.50	# Clause-clause subsumption calls (NU) : 14
0.20/0.50	# Rec. Clause-clause subsumption calls : 12
0.20/0.50	# Non-unit clause-clause subsumptions  : 1
0.20/0.50	# Unit Clause-clause subsumption calls : 0
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 1
0.20/0.50	# BW rewrite match successes           : 0
0.20/0.50	# Condensation attempts                : 0
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 2275
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.005 s
0.20/0.50	# System time              : 0.004 s
0.20/0.50	# Total time               : 0.009 s
0.20/0.50	# Maximum resident set size: 1960 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.015 s
0.20/0.50	# System time              : 0.018 s
0.20/0.50	# Total time               : 0.033 s
0.20/0.50	# Maximum resident set size: 1752 pages
0.20/0.50	EOF